Associative concurrent evaluation of logic programs
نویسندگان
چکیده
منابع مشابه
Slicing Concurrent Logic Programs
Program slicing has been widely studied for imperative programs, but for logic programs it is just starting. In this paper we address the problem of slicing concurrent logic programs. To solve this problem, we propose three types of primary program dependences between arguments in concurrent logic programs, named the sharing dependence, communication dependence and uni cation dependence. We als...
متن کاملAbductive Behaviour of Concurrent Logic Programs
We present a possible way to model abduction within the framework of concurrent logic programming. In particular, we describe an extension to the concurrent logic programming language PARLOG and an associated computational model which allows a user to specify an abductive behaviour for a concurrent logic program. The proposed model therefore exploits the inherent parallelism of concurrent logic...
متن کاملLinearity Analysis of Concurrent Logic Programs
Automatic memory management and the hiding of the notion of pointers are the prominent features of symbolic processing languages. They make programming easy and guarantee the safety of memory references. For the memory management of linked data structures, copying garbage collection is most widely used because of its simplicity and desirable properties. However, if certain properties about runt...
متن کاملOrdering Optimisations for Concurrent Logic Programs
Ordering optimisations are optimisations that can be applied to a concurrent logic program when the atoms of a clause are known to be ordered. In this paper ordering optimisations are reviewed, reformulated and refined. The paper explains how ordering optimisations can be realised in terms of abstract interpretation and shows that by, building on schedule analysis, simple, efficient and accurat...
متن کاملA Separation Logic for Concurrent Randomized Programs
We present a concurrent separation logic with support for probabilistic reasoning. As part of our logic, we extend the idea of coupling, which underlies recent work on probabilistic relational logics, to the setting of programs with both probabilistic and non-deterministic choice. To demonstrate our logic, we verify a variant of a recent randomized concurrent counter algorithm. All of our resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1984
ISSN: 0743-1066
DOI: 10.1016/0743-1066(84)90026-8